The Online Space Complexity of Probabilistic Languages
نویسنده
چکیده
In this paper, we define the online space complexity of languages, as the size of the smallest abstract machine processing words sequentially and able to determine at every point whether the word read so far belongs to the language or not. The first part of this paper motivates this model and provides examples and preliminary results. One source of inspiration for introducing the online space complexity of languages comes from a seminal paper of Rabin from 1963, introducing probabilistic automata, which suggests studying the online space complexity of probabilistic languages. This is the purpose of the second part of the current paper.
منابع مشابه
An Indoor Positioning System Based on Wi-Fi for Energy Management in Smart Buildings
To offer indoor services to occupants in the context of smart buildings, it is necessary to consider information concerning to the identity and location of the occupants. This paper proposes an indoor positioning system (IPS) based on Wi-Fi fingerprint and K-nearest neighbors (KNN) method. The positioning of a mobile device (MD) using Wi-Fi technology involves online and offline phases. In this...
متن کاملTask Condition and L2 oral Performance: Investigating the Combined Effects of Online Planning and Immediacy
Research evidence reported to date demonstrates the differential effects of manipulating second language (L2) task conditions on the resultant production as measured in terms of complexity, accuracy, and fluency. The present study was aimed at adding to the available body of findings by exploring the synergistic effects of two task condition variables, namely online planning and immediacy (± He...
متن کاملMenger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملThe effect of language complexity and group size on knowledge construction: Implications for online learning
This study investigated the effect of language complexity and group size on knowledge construction in two online debates. Knowledge construction was assessed using Gunawardena et al.’s Interaction Analysis Model (1997). Language complexity was determined by dividing the number of unique words by total words. It refers to the lexical variation. The results showed that...
متن کاملProperties of Multihead Two-way Probabilistic Nite Automata
We present properties of multihead two-way probabilistic nite automata that parallel those of their deterministic and nondeterministic counterparts. We deene multihead proba-bilistic nite automata with log-space constructible transition probabilities, and we describe a simple technique to simulate these automata by standard log-space probabilistic Turing machines. Next, we represent log-space p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016